Extending the Test Template Framework to Deal with Axiomatic Descriptions, Quantifiers and Set Comprehensions
نویسندگان
چکیده
The Test Template Framework (TTF) is a method for modelbased testing (MBT) from Z specifications. Although the TTF covers many features of the Z notation, it does not explain how to deal with axiomatic descriptions, quantifiers and set comprehensions. In this paper we extend the TTF so it can process specifications including these features. The techniques presented here may be useful for other MBT methods for the Z notation or for other notations such as Alloy and B, since they use similar mathematical theories.
منابع مشابه
A Lean Manufacturing Roadmap for an Automotive Body Assembly Line within Axiomatic Design Framework
In this paper we are to present a practical application of Axiomatic Design (AD) methodology, as a roadmap to lean production, in redesigning a car body assembly line. Axiomatic Design theory provides a framework to simplify the whole problem. According to the AD principles, a hierarchical structure has been developed. The developed structure originated in lean manufacturing principles and exis...
متن کاملStable Models of Formulas with Generalized Quantifiers (Preliminary Report)
Applications of answer set programming motivated various extensions of the stable model semantics, for instance, to allow aggregates or to facilitate interface with external ontology descriptions. We present a uniform, reductive view on these extensions by viewing them as special cases of formulas with generalized quantifiers. This is done by extending the first-order stable model semantics by ...
متن کاملAn Axiomatic Theory of Fuzzy Quantifiers in Natural Languages
Many applications e.g. in approximate reasoning, data summarisation, information retrieval etc. can profit from the use of fuzzy quantifiers like “almost all” or “many”, which provide flexible means of information aggregation, and are capable of extracting meaningful linguistic summaries from large amounts of raw data. However, as will be shown by a number of counterexamples, existing approache...
متن کاملA Formal Theory of Fuzzy Natural Language Quantification and its Role in Granular Computing
Fuzzy quantification is a linguistic granulation technique capable of expressing the global characteristics of a collection of individuals, or a relation between individuals, through meaningful linguistic summaries. However, existing approaches to fuzzy quantification fail to provide convincing results in the important case of two-place quantification (e.g. “many blondes are tall”). We develop ...
متن کاملConstraint Logic Programming over Infinite Domains with an Application to Proof
We present a CLP(FD)-based constraint solver able to deal with unbounded domains. It is based on constraint propagation, resorting to enumeration if all other methods fail. An important aspect is detecting when enumeration was complete and if this has an impact on the soundness of the result. We present a technique which guarantees soundness in the following way: if the constraint solver finds ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012